The Hierarchy of Dependency Pairs
نویسندگان
چکیده
abstract: Recently, dependency pairs have greatly extended the provable class of terminating of term rewriting systems. The set of dependency pairs itself makes a term rewriting system. However, a term rewriting system and its dependency pairs do not accurately agree on the termination property. In this paper, we study the relation for the termination property between a term rewriting system, the set of its dependency pairs and the union of them.
منابع مشابه
A Lax Operator Hierarchy for the New Fifth Order Integrable System
We consider the Lax representation of the new two-component coupled integrable system recently discovered by the author. Connection of the hierarchy of infinitely many Lax pairs with each other is presented.
متن کاملModeling the Dependency Structure between Stocks of Chemical Products Return, Oil Price and Exchange Rate Growth in Iran; an Application of Vine Copula
The main objective of this study is modeling the dependency structure between the returns of oil markets, exchange rate and stocks of chemical products in Iran. For this purpose, the theory of Vine Copula functions is used to investigate the dependency structure. In addition to consider a linear relationship between financial markets in Iran, the nonlinear dependency structure of these markets ...
متن کاملAn annotation scheme for Persian based on Autonomous Phrases Theory and Universal Dependencies
A treebank is a corpus with linguistic annotations above the level of the parts of speech. During the first half of the present decade, three treebanks have been developed for Persian either originally or subsequently based on dependency grammar: Persian Treebank (PerTreeBank), Persian Syntactic Dependency Treebank, and Uppsala Persian Dependency Treebank (UPDT). The syntactic analysis of a sen...
متن کاملA Hierarchy of Mildly Context-Sensitive Dependency Grammars
The paper presents Colored Multiplanar Link Grammars (CMLG). These grammars are reducible to extended right-linear S-grammars (Wartena 2001) where the storage type S is a concatenation of c pushdowns. The number of colors available in these grammars induces a hierarchy of Classes of CMLGs. By fixing also another parameter in CMLGs, namely the bound t for non-projectivity depth, we get c-Colored...
متن کاملTopological Hierarchy for Functions on Triangulated Surfaces
We combine topological and geometric methods to construct a multi-resolution representation for a function over a two-dimensional domain. In a preprocessing stage, we create the Morse-Smale complex of the function and progressively simplify its topology by canceling pairs of critical points. Based on a simple notion of dependency among these cancellations we construct a hierarchical data struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999